Modulo Operation Free Reverse Conversion in the {2^(2n+1)-1,2^n,2^2n-1} Moduli Set
نویسندگان
چکیده
This paper proposes a fast Mixed Radix Conversion based reverse converter for the recently proposed moduli set ?{2?^(2n+1)-1,2^n,2^2n-1}. It shows that the computation of multiplicative inverses could be eliminated from the conversion process and presents a low complexity and modulo operation free implementation. Theoretical analysis shows that the proposed scheme outperforms all state of the art equivalent converters in terms of both area cost and delay.
منابع مشابه
RNS - to - Binary Converter for New Four - Moduli Set { 2 n − 1 , 2 n , 2 n + 1 − 1 , 2 n + 1 + 2 n − 1 } ∗
In this paper, a new four-moduli set {2n − 1, 2n, 2n+1 − 1, 2n+1 + 2n − 1} is proposed. The new moduli set choice because of a fast modulo 2n+1 + 2n − 1 adder has been proposed in literature. In order to work out the reverse converter for this moduli set, we introduce the technique for modulo 2n+1+2n−1 of a negative number and modulo 2n+1+2n−1 multiplication of a residue number by 2 and design ...
متن کاملA reverse converter for the new 4-moduli set {2n + 3, 2n + 2, 2n + 1, 2n}
In this paper, we propose a new 4-moduli set {2n+ 3, 2n+ 2, 2n+ 1, 2n} that increases the dynamic range and the processing parallelism enabling efficient reverse conversion. First, we assume a general 4-moduli set {mi}i=1,4, m1 > m2 > m3 > m4, with the dynamic range M = ∏4 i=1 mi and introduce a modified Chinese Remainder Theorem (CRT) that requires mod-m4 instead of mod-M calculations. Subsequ...
متن کاملA Residue to Binary Converter for the {2n + 2, 2n + 1, 2n} Moduli Set
In this paper, we investigate Residue Number System (RNS) to decimal conversion for a three moduli set with a common factor. We propose a new RNS to binary converter for the moduli set {2n + 2, 2n + 1, 2n} for any even integer n > 0. First, we demonstrate that for such a moduli set, the computation of the multiplicative inverses can be eliminated. Secondly, we simplify the Chinese Remainder The...
متن کاملA General Reverse Converter Architecture with Low Complexity and High Performance
This paper presents a general architecture for designing efficient reverse converters based on the moduli set {2α, 22β+1-1, 2β-1}, where β ≺ α 2β, by using a parallel implementation of mixed-radix conversion (MRC) algorithm. The moduli set {2α, 22β+1-1, 2β-1} is free from modulo (2k+1)-type which can result in an efficient arithmetic unit for residue number system (RNS). The values of α and β c...
متن کاملA Reduced-Area Reverse Converter for the Moduli Set {2n, 2n-1, 22n-1-1}
Abstract The three-modulus residue number system (RNS) based on the moduli set {2, 2–1, 2–1} has been recently introduced. The modulo (2+1)-free feature of this set enables it to provide fast realization of modular addition and multiplication circuits of RNS arithmetic unit. But, the latest design of the RNS to binary (reverse) converter for the moduli set {2, 2–1, 2–1} relies on large hardware...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014